SDXP

The conference aimed at supporting and stimulating active productive research set to strengthen the technical foundations of engineers and scientists in the continent, through developing strong technical foundations and skills, leading to new small to medium enterprises within the African sub-continent. It also seeked to encourage the emergence of functionally skilled technocrats within the continent.Distributed protocols implementations over a large network is a well-studied problem that converges asymptotically; however, existing protocols do not provide a way for each node to distributively detect the level of trust of another node. In this paper a method is developed to distributively determine whether a certain node should be trusted or not. In absence of such a method all nodes in the network keep communicating and running various computations even a certain node is known to be the origin of unwanted traffic, which is not preferable as in large-scale distributed networks resources like power are limited. Moreover, this additional communication can cause signal interference with other critical information. This distributed data security protocol is expected to take finite time and occurs at each node simultaneously.Strathmore University (SU); Institute of Electrical and Electronics Engineers (IEEE

Scalable dataspace construction

The conference aimed at supporting and stimulating active productive research set to strengthen the technical foundations of engineers and scientists in the continent, through developing strong technical foundations and skills, leading to new small to medium enterprises within the African sub-continent. It also seeked to encourage the emergence of functionally skilled technocrats within the continent.This paper proposes the design and implementation of scalable dataspaces based on efficient data structures. Dataspaces are often likely to exhibit a multidimensional structure due to the unpredictable neighbour relationship between participants coupled by the continuous exponential growth of data. Layered range trees are incorporated to the proposed solution as multidimensional binary trees which are used to perform d-dimensional orthogonal range indexing and searching. Furthermore, the solution is readily extensible to multiple dimensions, raising the possibility of volume searches and even extension to attribute space. We begin by a study of the important literature and dataspace designs. A scalable design and implementation is further presented. Finally, we conduct experimental evaluation to illustrate the finer performance of proposed techniques. The design of a scalable dataspace is important in order to bridge the gap resulting from the lack of coexistence of data entities in the spatial domain as a key milestone towards pay-as-you-go systems integrationStrathmore University;nstitute of Electrical and Electronics Engineers (IEEE

Deriving a transparent dataspace-oriented entity associative algorithm

Thesis Submitted in total fulfillment of the requirements for the degree of Doctor of Philosophy in Information TechnologyOrganizations possess data residing in varied data sources though there is no effective way of integrating these repositories to provide information to end users transparently. This is primarily caused by the fact that the existing data is stored in databases that consist of varied models and techniques of both storage and access to data. The main aim of this research was to formulate a set of algorithms to support the development of a dataspace support platform that integrates data residing in divergent data stores. These techniques facilitate the asscociation of data entities in a dataspace by enabling entity coexistence for integrating data residing in divergent data stores. The research objectives were to analyze the state of dataspace implementation, to develop a model that outlines the criteria for successful dataspace design, to develop a dataspace support platform that integrates data residing in divergent data stores and to conduct experiments to validate the scalability of the implemented dataspace support platform. In order to achieve these objectives, the soft systems theory is applied. A literature survey approach is adopted and supplemented from the findings by use of brainstorming and further experiments. The findings have been used to identify facts pertaining to the principles, design and implementation of a dataspace support platform. The final outcome consists of a set of algorithms, models and a test dataspace support platform. Access to information is facilitated through a more scalable, flexible and transparent platform regardless of the underlying data models. This results to a O(log n + k ) query response time coupled with a O(n) build time on the entire dataspace. In conclusion, the triggers for enterprise systems integration are apparent, and compliance is only one of numerous drivers pushing organizations towards achieving a more integrated outlook of enterprise data. With the dataspace-oriented entity associative algorithm, users can have the ability to harness or filter informational requirements so as to enhance decision making in terms of time, accuracy and availability of information.Strathmore Universit